Once more on matrogenic graphs
نویسندگان
چکیده
منابع مشابه
λ-Coloring Matrogenic Graphs
This paper investigates a variant of the general problem of assigning channels to the stations of a wireless network when the graph representing the possible interferences is a matrogenic graph. In our problem, channels assigned to adjacent vertices must be at least two apart, while channels assigned to vertices at distance two must be different. An exact linear time algorithm is provided for t...
متن کاملMatroids arisen from matrogenic graphs
Let G be a finite simple graph and let 4(G) be the set of subsets X of V(G) such that the subgraph of G induced by X is threshold. If 4(G) is the independence system of a matroid, then G is called matrogenic [3]. In this paper, we characterize matroids arising from matrogenic graphs.
متن کاملMore Equienergetic Signed Graphs
The energy of signed graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. Two signed graphs are said to be equienergetic if they have same energy. In the literature the construction of equienergetic signed graphs are reported. In this paper we obtain the characteristic polynomial and energy of the join of two signed graphs and thereby we give another construction ...
متن کاملOnce more unto the breach, dear friends, once more.
The first issue of the World Journal of Critical Care Medicine (WJCCM), whose preparatory work was initiated on December 16, 2010, will be published on February 4, 2012. The WJCCM Editorial Board has now been established and consists of 105 distinguished experts from 27 countries. Our purpose of launching the WJCCM is to publish peer-reviewed, high-quality articles via an open-access online pub...
متن کاملMORE ON EDGE HYPER WIENER INDEX OF GRAPHS
Let G=(V(G),E(G)) be a simple connected graph with vertex set V(G) and edge set E(G). The (first) edge-hyper Wiener index of the graph G is defined as: $$WW_{e}(G)=sum_{{f,g}subseteq E(G)}(d_{e}(f,g|G)+d_{e}^{2}(f,g|G))=frac{1}{2}sum_{fin E(G)}(d_{e}(f|G)+d^{2}_{e}(f|G)),$$ where de(f,g|G) denotes the distance between the edges f=xy and g=uv in E(G) and de(f|G)=∑g€(G)de(f,g|G). In thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1984
ISSN: 0012-365X
DOI: 10.1016/0012-365x(84)90026-8